More Jabber about the Collatz Conjecture and a Closed Form for Detecting Cycles on Special Subsequences [Assertion: Collatz cycles]

نویسنده

  • Thomas W. Lynch
چکیده

In [ref 1] apparently published in 2006 professor Cadogan presents an interesting function that maps natural numbers into a two dimensional array based on how many ones the number trails off with. The length of trailing one's is said to be the row index. The rest of the number, divided by 2, is the column index. He then shows that applying the Collatz function reduces the ending string of ones by one causing it to drop down a row. At the bottom of the table are odd numbers ending in 'xxx..01' a tail length of one. He reports that a restart function and continued iteration then causes a to monotonic reduction in column indexes, and the existence of this algorithm proves the conjecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Bounds for the Length of Rational Collatz Cycles

We consider the arithmetics of Collatz cycles in Q(2)]. In particular , we prove optimal estimates for the length of a cycle in terms of its minimum. As an application, we derive an improved version of Eliahou's criterion , and we show that the length of (integer) Collatz cycles which do not contain 1, is at least 102 225 496 provided the Collatz conjecture is veriied for all initial values x 0...

متن کامل

Some Natural Generalizations Of The Collatz Problem∗

We define here simple natural generalizations of Collatz Problem, stating some corresponding conjectures and showing some first interesting computations. We also address the conceptual importance of this kind of problems and the expected diffi culties into solving them. 1 Why Generalize an Apparently Intractable Problem? The Collatz Conjecture or 3x + 1 Conjecture, an elusive two-line algorithm...

متن کامل

The Collatz Conjecture and Integers of the Form

One of the more well-known unsolved problems in number theory is the Collatz (3n + 1) Conjecture. The conjecture states that iterating the map that takes even n ∈ N to n 2 and odd n to 3n+1 2 will eventually yield 1. This paper is an exploration of this conjecture on positive integers of the form 2kb − m and 3kb − 1, and stems from the work of the first author’s Senior Seminar research. We take...

متن کامل

A New Proof of the Collatz Conjecture

This paper is a revised version of a previous paper by the author that, after publication, was found to contain an error. This paper supersedes and replaces the previous paper. A modified form of the Collatz transformation is formulated, leading to the concept of a modified Collatz chain. A smallest counterexample N0 to the Collatz Conjecture is hypothesized ; the existence of N0 implies that N...

متن کامل

Cellular Automata to More Efficiently Compute the Collatz Map

The Collatz, or 3x+ 1, Conjecture claims that for every positive integer n, there exists some k such that T (n) = 1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the Collatz map in bases 2, 3, and 4 into a local one of transforming the digits of iterates. The CAs streamline computation first by bypassing calculation of certai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1108.4056  شماره 

صفحات  -

تاریخ انتشار 2011